منابع مشابه
Paradigms : Searching Kees van der Laan
%Salomon’s fitting text to a box % %Sept 95, [email protected] \begingroup %Text \toks0{Leentje leerde lotje lopen langs de lange lindenlaan.} %Restrictions \hsize=3cm \dimen1=20pt%\vsize=20pt \def\showresult{\rlap{\f Fontsize=\the\dimen0\quad ht, dp=\the\ht0, \the \dp0} \copy0\smallbreak} %Start: first estimate size of font \dimen0=5pt \loop\font\f=cmr10 at\dimen0 \setbox0=\vbo...
متن کاملMath into BLUes 1 Kees van der Laan
TEXing mathscripts is not simply typing. Math has to be translated into TEX commands. First the motivation for this work is given. Next traditional math page make-up is summarized along with the macroscopic math TEX commands. After answering ‘Why TEXing mathscripts is difficult?’ an anthology of TEXfalls and their antidotes is discussed. At the end suggestions are given in order to lessen the d...
متن کاملKees Van Der Laan Prelude for You and Me
TEXing mathscripts is not simply typing. Math has to be translated into TEX commands. First the motivation for this work is given. Next traditional math page make-up is summarized along with the macroscopic math TEX commands. After answering ‘Why TEXing mathscripts is difficult?’ an anthology of TEXfalls and their antidotes is discussed. At the end suggestions are given in order to lessen the d...
متن کاملKees Van Deemter and Emiel Krahmer Graphs and Booleans: on the Generation of Referring Expressions
Generation of Referring Expressions (gre) is a key task of Natural Language Generation nlg systems (e.g., Reiter and Dale, 2000, section 5.4). The task of a gre algorithm is to find combinations of properties that allow the generator to refer uniquely to an object or set of objects, called the target of the algorithm. Older gre algorithms tend to be based on a number of strongly simplifying ass...
متن کاملTypesetting number sequences FIFO and some more : : : Kees van der Laan
Typesetting sequences of numerical values, represented via symbolic names which get their values on the fly, is dealt with. The sorting of the sequence is done by a linear sorting algorithm, of complexity O(n2). Three or more consecutive numbers are typeset as a range. The objective was to encode typesetting sequences of numbers as simple,concise, general, compatible, modular, orthogonal, and :...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Poetics
سال: 2018
ISSN: 0304-422X
DOI: 10.1016/j.poetic.2018.10.004